On Borel Probability Measures and Noncooperative Game Theory
ثبت نشده
چکیده
In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function f and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies.
منابع مشابه
A game theory approach to the Iranian forest industry raw material market
Dynamic game theory is applied to analyze the timber market in northern Iran as a duopsony. The Nash equilibrium and the dynamic properties of the system based on marginal adjustments are determined. When timber is sold, the different mills use mixed strategies to give sealed bids. It is found that the decision probability combination of the different mills follow a special form of attractor an...
متن کاملHyperfiniteness and Borel Combinatorics
We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge chromatic numbers of bounded degree acyclic hyperfinite Borel graphs and use this to answer a question of Kechris and Marks about the relationship between Borel c...
متن کاملIsomorphisms for Convergence Structures. II. Borel Spaces and Infinite Measures
In [10] we introduced a new notion of isomorphisms for topological measure spaces, which preserve almost sure continuity of mappings, almost sure convergence of random variables, and weak convergence of probability measures. The main thrust of that paper is the construction of an isomorphism from a Polish space with a nonatomic Borel probability measure to the unit Lebesgue interval (I, *). App...
متن کاملUniformity, Universality, and Computability Theory
We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened ...
متن کاملStochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs
We introduce a multi-input stochastic extremum seeking algorithm to solve the problem of seeking Nash equilibria for a noncooperative game whose N players seek to maximize their individual payoff functions. The payoff functions are general (not necessarily quadratic), and their forms are not known to the players. Our algorithm is a nonmodel-based approach for asymptotic attainment of the Nash e...
متن کامل